On quasi-Souslin space and closed graph theorem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Banach's Continuous Inverse Theorem and Closed Graph Theorem

The terminology and notation used here have been introduced in the following articles: [3], [4], [2], [15], [11], [14], [1], [5], [13], [12], [19], [20], [16], [7], [17], [8], [18], [9], and [6]. Let X, Y be non empty normed structures, let x be a point of X, and let y be a point of Y . Then 〈x, y〉 is a point of X × Y. Let X, Y be non empty normed structures, let s1 be a sequence of X, and let ...

متن کامل

Some forms of the closed graph theorem

In this paper we shall establish some forms of the closed, graph theorem for locally convex spaces, using the approach of Ptak(l7). Our interest is in classifying pairs of locally convex spaces (E, F) which have the property that every closed graph linear mapping T: E -> F is continuous; if (E,F) has this property then we shall say that (E, F) is in the class *&. \is# is a particular class of l...

متن کامل

The Closed Graph Theorem and the Space of Henstock-Kurzweil Integrable Functions with the Alexiewicz Norm

and Applied Analysis 3 Then, as L[a, b] ⊂ HK([a, b]) it holds that dim(L[a, b]) ≤ dim(HK([a, b])) ≤ card(HK([a, b])). Therefore, by Lemma 8, Corollary 7 and the known fact that c0 = c, we obtain the desired conclusion. Hereafter, the Alexiewicz topology and the topology induced by the norm of Proposition 9 will be denoted as τ A and τ ‖⋅‖ , respectively. Proposition 10. The topology τ ‖⋅‖ on HK...

متن کامل

On full Souslin trees

In the present note we answer a question of Kunen (15.13 in [Mi91]) showing (in 1.7) that it is consistent that there are full Souslin trees. ∗ We thank the NSF for partially supporting this research under grant #144-EF67. Publication No 624.

متن کامل

On Petersen's graph theorem

In thiq paper we prove the following: let G be a graph with k edges, wihich js (k l)-edgeconnectd, and with all valences 3k k. Let 1 c r~ k be an integer, then (3 -tins a spanning subgraph H, so that all valences in H are ar, with no more than r~/r:] edges. The proof is based on a useful extension of Tutte’s factor theorem [4,5], due to JN&Z [3]. For other extensions of Petersen’s theorem, see ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences

سال: 1970

ISSN: 0386-2194

DOI: 10.3792/pja/1195520268